Towards Disruption-Free Intra-Domain Routing
نویسندگان
چکیده
We present the basic design of Cost-Carrying Packets (CCP), a novel routing framework to achieve disruption-free intra-domain routing. Under CCP, each packet carries a short label to indicate the remaining path cost to reach its destination. Downstream routers use path costs carried by packets and their locally computed path costs to detect inconsistent forwarding paths and repair the inconsistencies using pre-computed paths. The preliminary simulation results suggest that CCP can shorten the service disruption time to be commensurate with the failure detection time without delaying routing convergence.
منابع مشابه
Inter-domain router placement and traffic engineering
The Internet is organized as an interconnection of separate administrative domains called Autonomous Systems (AS). The Border Gateway Protocol (BGP) is the de facto standard for controlling the routing of traffic across different ASs. It supports scalable distribution of reachability and routing policy information among different ASs. In this paper, we study a network design problem which deter...
متن کاملOptimised Multi Homing - an Approach for Inter-domain Traffic Engineering
Traffic engineering (TE) has been widely investigated in recent years. Though, the scope of these works were predominantly limited to intra-domain TE and single administrative domains. Not even the long term TE with monitoring and analysis of traffic exchange points has been adequately solved, not to mention the short term, real-time performance related inter-domain TE tasks. This is in spite o...
متن کاملOn the State of the Inter-domain and Intra-domain Routing Security
Routing is a key component for building an interconnected network architecture. There are interdomain and intra-domain routing protocols. The interdomain routing protocol has experienced increasingly frequent anomalies, such as IP prefix hijackings, route leaks, or impact from large-scale disruptive routing events. The intra-domain routing also suffers from various attacks originated from withi...
متن کاملA Multi-path Routing Algorithm for IP Networks Based on Flow Optimisation
Intra-domain routing in the Internet normally uses a single shortest path to forward packets towards a specific destination with no knowledge of traffic demand. We present an intra-domain routing algorithm based on multi-commodity flow optimisation which enable load sensitive forwarding over multiple paths. It is neither constrained by weight-tuning of legacy routing protocols, such as OSPF, no...
متن کاملOSPF Performance and Optimization of Open Source Routing Software
OSPF (Open Shortest Path First) is a widely used intra-domain routing protocol in IP networks. Processing delays in OSPF implementations impact the time needed for both intra-domain and inter-domain routing to re-convergence after a topology change. The re-convergence capability of a router can be characterized by a performance index, referred to as switching time. We have built a test-bed and ...
متن کامل